Multicast virtual topologies in WDM paths and rings with splitting loss

نویسندگان

  • Ran Libeskind-Hadas
  • Jeffrey R. K. Hartline
  • Kurt M. Dresner
  • Ethan W. Drucker
  • Katrina J. Ray
چکیده

This paper addresses the problem of constructing optimal virtual topologies for multicast communication in optical networks employing wavelength-division multiplexing (WDM). For concreteness, we use the average hop distance as the metric of optimality. WDM networks supporting multicast communication typically employ multicast-capable switches which permit a path entering a switch on an incoming wavelength to be replicated or “split” optically to one or more output links. This splitting incurs a power loss which is frequently neglected in existing heuristics and algorithms. In this paper we show that the problem of finding optimal virtual topologies with splitting loss constraints can be solved in polynomial time in directed paths and rings, although the problem is NP-complete for general topologies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Hybrid Topology Design for Integrated Traffic Support in WDM Mesh Networks (Invited Paper)

The future Internet will require the transport of a wide range of services including high bandwidth one-to-many applications, with a dynamic interconnection of devices. WDM layer support realizes such services in a transparent, reliable and efficient way. Most of the recent studies have been focused on efficiently building and configuring light-paths for unicast or light-trees for multicast in ...

متن کامل

Wide-sense nonblocking multicast in a class of regular optical WDM networks

Multicast communication involves transmitting information from a single source node to multiple destination nodes, and is becoming an important requirement in high-performance networks. In this paper, we study multicast communication in a class of optical WDM networks with regular topologies such as linear arrays, rings, meshes, tori and hypercubes. For each type of network, we derive the neces...

متن کامل

Work in Progress: Cost Bounds of Multicast Light-trees in WDM Networks

The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting constraint and the absence of wavelength converters, several light-trees may be required to establish a multicast session. However, the computation of optimal multicast light-trees is NP-hard. In this paper, we study th...

متن کامل

Cost Bounds of Multicast Light-Trees in WDM Networks

The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting constraint and the absence of wavelength converters, several light-trees may be required to establish a multicast session. However, the computation of optimal multicast light-trees is NP-hard. In this paper, we study th...

متن کامل

On fundamental issues in IP over WDM multicast

As WDM technology matures, IP over WDM multicast becomes a new challenging topic. Supporting multicast at the WDM layer provides additional advantages, but also raises many new issues that do not exist in IP multicast. For example, the limitation on the light splitting capability of switches is one major difficulty in WDM multicast, and in addition, the limitations on both the wavelength conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002